Geometric Lower Bounds for Parametric Matroid Optimization
نویسندگان
چکیده
منابع مشابه
Query Lower Bounds for Matroid Intersection
We consider the number of queries needed to solve the matroid intersection problem, a question raised by Welsh (1976). Given two matroids of rank r on n elements, it is known that O(nr) independence queries suffice. Unfortunately, very little is known about lower bounds for this problem. This paper describes three lower bounds which, to our knowledge, are the best known: 2n− 2 queries are neede...
متن کاملSome Geometric Lower Bounds
Dobkin and Lipton introduced the connected components argument to prove lower bounds in the linear decision tree model for membership problems, for example the element uniqueness problem. In this paper we apply the same idea to obtain lower bound statements for a variety of problems, each having the avor of element uniqueness. In fact one of these problems is a parametric version of element uni...
متن کاملLower Bounds for Polynomials Using Geometric Programming
We make use of a result of Hurwitz and Reznick [8] [19], and a consequence of this result due to Fidalgo and Kovacec [5], to determine a new sufficient condition for a polynomial f ∈ R[X1, . . . , Xn] of even degree to be a sum of squares. This result generalizes a result of Lasserre in [10] and a result of Fidalgo and Kovacec in [5], and it also generalizes the improvements of these results gi...
متن کاملLower Bounds for Geometric Diameter Problems
The diameter of a set P of n points in R is the maximum Euclidean distance between any two points in P . If P is the vertex set of a 3-dimensional convex polytope, and if the combinatorial structure of this polytope is given, we prove that, in the worst case, deciding whether the diameter of P is smaller than 1 requires Ω(n log n) time in the algebraic computation tree model. It shows that the ...
متن کاملLower Bounds for Fundamental Geometric Problems
Lower Bounds for Fundamental Geometric Problems by Je rey Gordon Erickson Doctor of Philosophy in Computer Science University of California at Berkeley Professor Raimund Seidel, Chair We develop lower bounds on the number of primitive operations required to solve several fundamental problems in computational geometry. For example, given a set of points in the plane, are any three colinear? Give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1998
ISSN: 0179-5376
DOI: 10.1007/pl00009396